Polynomial Silent Self-Stabilizing p-Star Decomposition†
نویسندگان
چکیده
منابع مشابه
Polynomial Silent Self-Stabilizing p-Star Decomposition
We present a silent self-stabilizing distributed algorithm computing a maximal p-star decomposition of the underlying communication network. Under the unfair distributed scheduler, the most general scheduler model, the algorithm converges in at most 12∆m +O(m + n) moves, where m is the number of edges, n is the number of nodes, and ∆ is the maximum node degree. Regarding the move complexity, ou...
متن کاملPolynomial Silent Self-Stabilizing Maximal p-Star Decomposition
HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau...
متن کاملA Self-stabilizing Algorithm for Maximal p-Star Decomposition of General Graphs
A p-star is a complete bipartite graph K1,p with one center node and p leaf nodes. In this paper we propose the first distributed self-stabilizing algorithm for graph decomposition into p-stars. For a graph G and an integer p ≥ 1, this decomposition provides disjoint components of G where each component forms a p-star. We prove convergence and correctness of the algorithm under an unfair distri...
متن کاملDependability Engineering of Silent Self-stabilizing Systems
Self-stabilization is an elegant way of realizing non-masking fault-tolerant systems. Sustained research over last decades has produced multiple self-stabilizing algorithms for many problems in distributed computing. In this paper, we present a framework to evaluate multiple selfstabilizing solutions under a fault model that allows intermittent transient faults. To that end, metrics to quantify...
متن کاملSilent Self-stabilizing BFS Tree Algorithms Revised
In this paper, we revisit two fundamental results of the self-stabilizing literature about silent BFS spanning tree constructions: the Dolev et al algorithm and the Huang and Chen’s algorithm. More precisely, we propose in the composite atomicity model three straightforward adaptations inspired from those algorithms. We then present a deep study of these three algorithms. Our results are relate...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 2019
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/bxz102